On-Line Electrocardiogram Lossless Compression Using Antidictionary Codes for a Finite Alphabet
نویسندگان
چکیده
منابع مشابه
On-line Electrocardiogram Lossless Compression Using Antidictionary-Based Methods
This paper proposes on-line electrocardiogram (ECG) lossless data compression based on antidictionaries. An antidictionary is the set of all words of minimal length that never appear in the string. The proposed methods use the coders constructed by a training sequence of constant length of ECG, so that they work with an on-line manner in constant computational space. Their effectiveness is demo...
متن کاملLOSSLESS COMPRESSION AND ALPHABET SIZE by DANIEL
Lossless data compression through exploiting redundancy in a sequence of symbols is a well-studied field in computer science and information theory. One way to achieve compression is to statistically model the data and estimate model parameters. In practice, most general purpose data compression algorithms model the data as stationary sequences of 8-bit symbols. While this model fits very well ...
متن کاملLossless Image Compression using Wavelets over Finite
In this paper we give a brief introduction to lter banks over commutative rings. In contrast to lter banks over the real numbers, we employ nite ring arithmetic to control the number of bits in the signal representations. This way we avoid the coeecient swell problem that is preeminent in rings of characteristic zero. We derive decompositions for images that are tailored to dedicated hardware i...
متن کاملFountain codes for lossless data compression
This paper proposes a universal variable-length lossless compression algorithm based on fountain codes. The compressor concatenates the Burrows-Wheeler block sorting transform (BWT) with a fountain encoder, together with the closed-loop iterative doping algorithm. The decompressor uses a Belief Propagation algorithm in conjunction with the iterative doping algorithm and the inverse BWT. Linear-...
متن کاملImproved Antidictionary Based Compression
The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called “antifactors”) never appear in the text. Let sb be an antifactor, where b is its last bit. Every time s appears in the text we know that the next bit is b and hence omit its representation. Since building the set of all antifactors is space consuming at compression time, it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2010
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e93.d.3384